package fr.neyb.bernouilli.problem007;

import fr.neyb.bernouilli.common.math.prime.PrimeGenerator1;

public class Entry {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		long res = 0;
		PrimeGenerator1 pg = new PrimeGenerator1();
		for (int i = 0 ; i < 10_001 ;i++){
			res=pg.getNextPrime();
		}
		System.out.println(res);
	}

}
